翻訳と辞書
Words near each other
・ Bitch Please II
・ Bitch Slap
・ Bitch Wars
・ Bitch We Have a Problem Tour
・ Bit Meddler
・ Bit mouthpiece
・ Bit Museum
・ Bit nibbler
・ Bit numbering
・ BIT Numerical Mathematics
・ Bit pairing
・ Bit Part
・ Bit part
・ Bit people
・ Bit plane
BIT predicate
・ Bit rate
・ Bit Rate Reduction
・ Bit rate reduction
・ Bit ring
・ Bit rot
・ Bit shank
・ Bit slicing
・ Bit slip
・ Bit specification
・ Bit stuffing
・ BIT Teatergarasjen
・ Bit Test
・ Bit time
・ Bit twiddler


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

BIT predicate : ウィキペディア英語版
BIT predicate
In mathematics and computer science, the BIT predicate or Ackermann coding, sometimes written BIT(''i'', ''j''), is a predicate which tests whether the ''j''th bit of the number ''i'' is 1, when ''i'' is written in binary.
==History==
The BIT predicate was first introduced as the encoding of hereditarily finite sets as natural numbers by Wilhelm Ackermann in his 1937 paper
(''The Consistency of General Set Theory'').
Each natural number encodes a finite set and
each finite set is represented by a natural number.
This mapping uses the binary numeral system.
If the number ''n'' encodes a finite set ''A'' and the ''i''th binary digit of ''n'' is 1
then the set encoded by ''i'' is an element of ''A''.
The Ackermann coding is a primitive recursive function.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「BIT predicate」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.